Explicit substitutions for pi-congruences
نویسندگان
چکیده
منابع مشابه
A Pi-Calculus with Explicit Substitutions: the Late Semantics
A new formulation of the-calculus, where name instantiation is handled explicitly, is presented. The explicit handling of name instantiation allows us to reduce the-calculus transitional semantics to a standard SOS framework. Hence,-calculus bisimulation models can take fully advantage of the SOS meta-theory developed for`static' process calculi. For instance, complete axiomatic characterizatio...
متن کاملOgg's Theorem via Explicit Congruences for Class Equations Ogg's Theorem via Explicit Congruences for Class Equations *
Explicit congruences (mod p) are proved for the class equations or the products of class equations corresponding to discriminants D = −8p,−3p, −12p in the theory of complex multiplication, where p is an odd prime. These congruences are used to give a new proof of a theorem of Ogg, which states that there are exactly 15 primes p for which all j-invariants of supersingular elliptic curves in char...
متن کاملExplicit substitutions for control operators ?
The-calculus is a-calculus with a local operator closely related to normal-isation procedures in classical logic and control operators in functional programming. We introduce exp, an explicit substitution calculus for , show it preserves strong normali-sation and that its simply typed version is strongly normalising. Interestingly, exp is the rst example for which the decency method of showing ...
متن کاملExplicit Substitutions for Constructive Necessity
This paper introduces a -calculus with explicit substitutions, corresponding to an S4 modal logic of constructive necessity. As well as being semantically well motivated, the calculus can be used (a) to develop abstract machines, and (b) as a framework for specifying and analysing computation stages in the context of functional languages. We prove several syntactic properties of this calculus,...
متن کاملIntersection types for explicit substitutions
We present a new system of intersection types for a composition-free calculus of explicit substitutions with a rule for garbage collection, and show that it characterizes those terms which are strongly normalizing. This system extends previous work on the natural generalization of the classical intersection types system, which characterized head normalization and weak normalization, but was not...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2001
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00376-5